A Convex-concave Programming Method for Optimizing over the Efficient Set
نویسنده
چکیده
The problem of optimizing a real valued function over the efficient set of a multiple objective linear program has some applications in multiple objective decision making. The main difficulty of this problem arises from the fact that its feasible domain, in general, is nonconvex and not given explicitly. In this paper we formulate this problem as a linearly constrained convex-concave program where the number of “nonconvex variables” is just equal to the number of independent criteria. We propose inner and outer procedures to constructing an initial set allowing convex-concave programming decomposition methods to be applied.
منابع مشابه
On Optimization over the Efficient Set in Linear Multicriteria Programming
The efficient set of a linear multicriteria programming problem can be represented by a ’reverse convex constraint’ of the form g(z) ≤ 0, where g is a concave function. Consequently, the problem of optimizing some real function over the efficient set belongs to an important problem class of global optimization called reverse convex programming. Since the concave function used in the literature ...
متن کاملEscaping the Local Minima via Simulated Annealing: Optimization of Approximately Convex Functions
We consider the problem of optimizing an approximately convex function over a bounded convex set in Rn using only function evaluations. The problem is reduced to sampling from an approximately log-concave distribution using the Hit-and-Run method, which is shown to have the same O∗ complexity as sampling from log-concave distributions. In addition to extend the analysis for log-concave distribu...
متن کاملAn Extended Level Method for Efficient Multiple Kernel Learning
We consider the problem of multiple kernel learning (MKL), which can be formulated as a convex-concave problem. In the past, two efficient methods, i.e., Semi-Infinite Linear Programming (SILP) and Subgradient Descent (SD), have been proposed for large-scale multiple kernel learning. Despite their success, both methods have their own shortcomings: (a) the SD method utilizes the gradient of only...
متن کاملDC Decomposition of Nonconvex Polynomials with Algebraic Techniques
We consider the problem of decomposing a multivariate polynomial as the difference of two convex polynomials. We introduce algebraic techniques which reduce this task to linear, second order cone, and semidefinite programming. This allows us to optimize over subsets of valid difference of convex decompositions (dcds) and find ones that speed up the convex-concave procedure (CCP). We prove, howe...
متن کاملOptimality and Duality for an Efficient Solution of Multiobjective Nonlinear Fractional Programming Problem Involving Semilocally Convex Functions
In this paper, the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality...
متن کامل